0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n006.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 15:46:10 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.21/0.37	# No SInE strategy applied
0.21/0.37	# Trying AutoSched0 for 59 seconds
59.18/59.42	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
59.18/59.42	# and selection function SelectCQIPrecWNTNp.
59.18/59.42	#
59.18/59.42	# Preprocessing time       : 0.047 s
59.18/59.42	# Presaturation interreduction done
59.28/59.51	# No success with AutoSched0
59.28/59.51	# Trying AutoSched1 for 26 seconds
85.24/85.51	# AutoSched1-Mode selected heuristic G_E___211_C18_F1_AE_CS_SP_S0Y
85.24/85.51	# and selection function SelectMaxLComplexAvoidPosPred.
85.24/85.51	#
85.24/85.51	# Preprocessing time       : 0.023 s
85.34/85.60	# No success with AutoSched1
85.34/85.60	# Trying AutoSched2 for 8 seconds
93.33/93.60	# AutoSched2-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05AN
93.33/93.60	# and selection function PSelectComplexExceptUniqMaxPosHorn.
93.33/93.60	#
93.33/93.60	# Preprocessing time       : 0.023 s
93.33/93.60	# Presaturation interreduction done
93.38/93.62	# No success with AutoSched2
93.38/93.62	# Trying AutoSched3 for 7 seconds
100.38/100.62	# AutoSched3-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
100.38/100.62	# and selection function PSelectComplexExceptUniqMaxHorn.
100.38/100.62	#
100.38/100.62	# Preprocessing time       : 0.029 s
100.43/100.66	# No success with AutoSched3
100.43/100.66	# Trying AutoSched4 for 5 seconds
102.77/103.01	# AutoSched4-Mode selected heuristic G_E___107_B01_00_F1_PI_AE_Q4_CS_SP_PS_S071I
102.77/103.01	# and selection function SelectCQArEqLast.
102.77/103.01	#
102.77/103.01	# Preprocessing time       : 0.023 s
102.77/103.01	# Presaturation interreduction done
102.77/103.01	
102.77/103.01	# Proof found!
102.77/103.01	# SZS status Theorem
102.77/103.01	# SZS output start CNFRefutation
102.77/103.01	thf(fact_283_not0__implies__Suc, axiom, ![X6:nat]:(?[X160:nat]:(X6)=(suc @ X160)<=(X6)!=(zero_zero_nat)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_283_not0__implies__Suc)).
102.77/103.01	thf(fact_17_nat_Oinject, axiom, ![X188:nat, X189:nat]:((suc @ X188)=(suc @ X189)<=>(X188)=(X189)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_nat_Oinject)).
102.77/103.01	thf(fact_274_nat_OdiscI, axiom, ![X165:nat, X188:nat]:((X165)=(suc @ X188)=>(X165)!=(zero_zero_nat)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_274_nat_OdiscI)).
102.77/103.01	thf(fact_223_nonzero__mult__div__cancel__right, axiom, ![X3:int, X4:int]:((X3)!=(zero_zero_int)=>(divide_divide_int @ (times_times_int @ X4 @ X3) @ X3)=(X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_223_nonzero__mult__div__cancel__right)).
102.77/103.01	thf(fact_13_power__Suc, axiom, ![X4:int, X6:nat]:(power_power_int @ X4 @ (suc @ X6))=(times_times_int @ X4 @ (power_power_int @ X4 @ X6)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_13_power__Suc)).
102.77/103.01	thf(fact_109__092_060open_062_092_060And_062n_O_Ax_A_L_Ax_A_K_An_A_061_Ax_A_K_A_I1_A_L_An_J_092_060close_062, axiom, ![X128:int]:(plus_plus_int @ x @ (times_times_int @ x @ X128))=(times_times_int @ x @ (plus_plus_int @ one_one_int @ X128)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_109__092_060open_062_092_060And_062n_O_Ax_A_L_Ax_A_K_An_A_061_Ax_A_K_A_I1_A_L_An_J_092_060close_062)).
102.77/103.01	thf(fact_124_of__nat__Suc, axiom, ![X9:nat]:(semiri2019852685at_int @ (suc @ X9))=(plus_plus_int @ one_one_int @ (semiri2019852685at_int @ X9)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_124_of__nat__Suc)).
102.77/103.01	thf(fact_86_add_Ocommute, axiom, (plus_plus_int)=(^[X50:int, X51:int]:plus_plus_int @ X51 @ X50), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_86_add_Ocommute)).
102.77/103.01	thf(fact_273_old_Onat_Odistinct_I1_J, axiom, ![X72:nat]:(zero_zero_nat)!=(suc @ X72), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_273_old_Onat_Odistinct_I1_J)).
102.77/103.01	thf(fact_299_of__nat__neq__0, axiom, ![X6:nat]:(semiri2019852685at_int @ (suc @ X6))!=(zero_zero_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_299_of__nat__neq__0)).
102.77/103.01	thf(conj_0, conjecture, (divide_divide_int @ (plus_plus_int @ (divide_divide_int @ (power_power_int @ x @ (suc @ pm)) @ (power_power_int @ x @ pm)) @ (times_times_int @ x @ (semiri2019852685at_int @ pm))) @ (semiri2019852685at_int @ (suc @ pm)))=(x), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
102.77/103.01	thf(fact_20_p, axiom, (p)=(suc @ pm), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_20_p)).
102.77/103.01	thf(fact_0_xn, axiom, (power_power_int @ x @ p)=(n), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_xn)).
102.77/103.01	thf(fact_227_power__0__Suc, axiom, ![X6:nat]:(power_power_int @ zero_zero_int @ (suc @ X6))=(zero_zero_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_227_power__0__Suc)).
102.77/103.01	thf(fact_267_power__not__zero, axiom, ![X4:int, X6:nat]:((X4)!=(zero_zero_int)=>(power_power_int @ X4 @ X6)!=(zero_zero_int)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_267_power__not__zero)).
102.77/103.01	thf(fact_182_div__by__0, axiom, ![X4:int]:(divide_divide_int @ X4 @ zero_zero_int)=(zero_zero_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_182_div__by__0)).
102.77/103.01	thf(fact_291_plus__int__code_I1_J, axiom, ![X10:int]:(plus_plus_int @ X10 @ zero_zero_int)=(X10), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_291_plus__int__code_I1_J)).
102.77/103.01	thf(fact_288_times__int__code_I2_J, axiom, ![X80:int]:(times_times_int @ zero_zero_int @ X80)=(zero_zero_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_288_times__int__code_I2_J)).
102.77/103.01	thf(fact_180_bits__div__0, axiom, ![X4:int]:(divide_divide_int @ zero_zero_int @ X4)=(zero_zero_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_180_bits__div__0)).
102.77/103.01	thf(c_0_19, plain, ![X6:nat]:((X6)!=(zero_zero_nat)=>?[X160:nat]:(X6)=(suc @ X160)), inference(fof_simplification,[status(thm)],[fact_283_not0__implies__Suc])).
102.77/103.01	thf(c_0_20, plain, ![X1324:nat, X1325:nat]:(((suc @ X1324)!=(suc @ X1325)|(X1324)=(X1325))&((X1324)!=(X1325)|(suc @ X1324)=(suc @ X1325))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_17_nat_Oinject])])).
102.77/103.01	thf(c_0_21, plain, ![X1273:nat]:((X1273)=(zero_zero_nat)|(X1273)=(suc @ (esk7_1 @ X1273))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])).
102.77/103.01	thf(c_0_22, plain, ![X1425:nat, X1426:nat]:((X1425)!=(suc @ X1426)|(X1425)!=(zero_zero_nat)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_274_nat_OdiscI])])).
102.77/103.01	thf(c_0_23, plain, ![X1539:int, X1540:int]:((X1539)=(zero_zero_int)|(divide_divide_int @ (times_times_int @ X1540 @ X1539) @ X1539)=(X1540)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_223_nonzero__mult__div__cancel__right])])).
102.77/103.01	thf(c_0_24, plain, ![X992:int, X993:nat]:(power_power_int @ X992 @ (suc @ X993))=(times_times_int @ X992 @ (power_power_int @ X992 @ X993)), inference(variable_rename,[status(thm)],[fact_13_power__Suc])).
102.77/103.01	thf(c_0_25, plain, ![X1:nat, X2:nat]:((X1)=(X2)|(suc @ X1)!=(suc @ X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
102.77/103.01	thf(c_0_26, plain, ![X1:nat]:((X1)=(zero_zero_nat)|(X1)=(suc @ (esk7_1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_21])).
102.77/103.01	thf(c_0_27, plain, ![X2:nat, X1:nat]:((X1)!=(suc @ X2)|(X1)!=(zero_zero_nat)), inference(split_conjunct,[status(thm)],[c_0_22])).
102.77/103.01	thf(c_0_28, plain, ![X1196:int]:(plus_plus_int @ x @ (times_times_int @ x @ X1196))=(times_times_int @ x @ (plus_plus_int @ one_one_int @ X1196)), inference(variable_rename,[status(thm)],[fact_109__092_060open_062_092_060And_062n_O_Ax_A_L_Ax_A_K_An_A_061_Ax_A_K_A_I1_A_L_An_J_092_060close_062])).
102.77/103.01	thf(c_0_29, plain, ![X1521:nat]:(semiri2019852685at_int @ (suc @ X1521))=(plus_plus_int @ one_one_int @ (semiri2019852685at_int @ X1521)), inference(variable_rename,[status(thm)],[fact_124_of__nat__Suc])).
102.77/103.01	thf(c_0_30, plain, ![X50:int, X51:int]:(plus_plus_int @ X50 @ X51)=(plus_plus_int @ X51 @ X50), inference(fof_simplification,[status(thm)],[fact_86_add_Ocommute])).
102.77/103.01	thf(c_0_31, plain, ![X3:int, X4:int]:((X3)=(zero_zero_int)|(divide_divide_int @ (times_times_int @ X4 @ X3) @ X3)=(X4)), inference(split_conjunct,[status(thm)],[c_0_23])).
102.77/103.01	thf(c_0_32, plain, ![X3:int, X1:nat]:(power_power_int @ X3 @ (suc @ X1))=(times_times_int @ X3 @ (power_power_int @ X3 @ X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
102.77/103.01	thf(c_0_33, plain, ![X1:nat, X2:nat]:((X1)=(esk7_1 @ X2)|(suc @ X1)!=(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
102.77/103.01	thf(c_0_34, plain, ![X1060:nat]:(zero_zero_nat)!=(suc @ X1060), inference(variable_rename,[status(thm)],[fact_273_old_Onat_Odistinct_I1_J])).
102.77/103.01	thf(c_0_35, plain, ![X3:int]:(plus_plus_int @ x @ (times_times_int @ x @ X3))=(times_times_int @ x @ (plus_plus_int @ one_one_int @ X3)), inference(split_conjunct,[status(thm)],[c_0_28])).
102.77/103.01	thf(c_0_36, plain, ![X1:nat]:(semiri2019852685at_int @ (suc @ X1))=(plus_plus_int @ one_one_int @ (semiri2019852685at_int @ X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
102.77/103.01	thf(c_0_37, plain, ![X1451:nat]:(semiri2019852685at_int @ (suc @ X1451))!=(zero_zero_int), inference(variable_rename,[status(thm)],[fact_299_of__nat__neq__0])).
102.77/103.01	thf(c_0_38, negated_conjecture, (divide_divide_int @ (plus_plus_int @ (divide_divide_int @ (power_power_int @ x @ (suc @ pm)) @ (power_power_int @ x @ pm)) @ (times_times_int @ x @ (semiri2019852685at_int @ pm))) @ (semiri2019852685at_int @ (suc @ pm)))!=(x), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
102.77/103.01	thf(c_0_39, plain, ![X1014:int, X1015:int]:(plus_plus_int @ X1014 @ X1015)=(plus_plus_int @ X1015 @ X1014), inference(variable_rename,[status(thm)],[c_0_30])).
102.77/103.01	thf(c_0_40, plain, ![X3:int, X1:nat]:((divide_divide_int @ (power_power_int @ X3 @ (suc @ X1)) @ (power_power_int @ X3 @ X1))=(X3)|(power_power_int @ X3 @ X1)=(zero_zero_int)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
102.77/103.01	thf(c_0_41, plain, ![X1:nat]:(esk7_1 @ (suc @ X1))=(X1), inference(er,[status(thm)],[c_0_33])).
102.77/103.01	thf(c_0_42, plain, (p)=(suc @ pm), inference(split_conjunct,[status(thm)],[fact_20_p])).
102.77/103.01	thf(c_0_43, plain, ![X1:nat]:(zero_zero_nat)!=(suc @ X1), inference(split_conjunct,[status(thm)],[c_0_34])).
102.77/103.01	thf(c_0_44, plain, ![X3:int]:((divide_divide_int @ (plus_plus_int @ x @ (times_times_int @ x @ X3)) @ (plus_plus_int @ one_one_int @ X3))=(x)|(plus_plus_int @ one_one_int @ X3)=(zero_zero_int)), inference(spm,[status(thm)],[c_0_31, c_0_35])).
102.77/103.01	thf(c_0_45, plain, ![X1:nat]:(plus_plus_int @ x @ (times_times_int @ x @ (semiri2019852685at_int @ X1)))=(times_times_int @ x @ (semiri2019852685at_int @ (suc @ X1))), inference(spm,[status(thm)],[c_0_35, c_0_36])).
102.77/103.01	thf(c_0_46, plain, ![X1:nat]:(semiri2019852685at_int @ (suc @ X1))!=(zero_zero_int), inference(split_conjunct,[status(thm)],[c_0_37])).
102.77/103.01	thf(c_0_47, negated_conjecture, (divide_divide_int @ (plus_plus_int @ (divide_divide_int @ (power_power_int @ x @ (suc @ pm)) @ (power_power_int @ x @ pm)) @ (times_times_int @ x @ (semiri2019852685at_int @ pm))) @ (semiri2019852685at_int @ (suc @ pm)))!=(x), inference(split_conjunct,[status(thm)],[c_0_38])).
102.77/103.01	thf(c_0_48, plain, (power_power_int @ x @ p)=(n), inference(split_conjunct,[status(thm)],[fact_0_xn])).
102.77/103.01	thf(c_0_49, plain, ![X4:int, X3:int]:(plus_plus_int @ X3 @ X4)=(plus_plus_int @ X4 @ X3), inference(split_conjunct,[status(thm)],[c_0_39])).
102.77/103.01	thf(c_0_50, plain, ![X3:int, X1:nat]:((divide_divide_int @ (power_power_int @ X3 @ X1) @ (power_power_int @ X3 @ (esk7_1 @ X1)))=(X3)|(power_power_int @ X3 @ (esk7_1 @ X1))=(zero_zero_int)|(X1)=(zero_zero_nat)), inference(spm,[status(thm)],[c_0_40, c_0_26])).
102.77/103.01	thf(c_0_51, plain, (esk7_1 @ p)=(pm), inference(spm,[status(thm)],[c_0_41, c_0_42])).
102.77/103.01	thf(c_0_52, plain, (zero_zero_nat)!=(p), inference(spm,[status(thm)],[c_0_43, c_0_42])).
102.77/103.01	thf(c_0_53, plain, ![X1:nat]:(divide_divide_int @ (times_times_int @ x @ (semiri2019852685at_int @ (suc @ X1))) @ (semiri2019852685at_int @ (suc @ X1)))=(x), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_36]), c_0_45]), c_0_46])).
102.77/103.01	thf(c_0_54, plain, ![X1533:nat]:(power_power_int @ zero_zero_int @ (suc @ X1533))=(zero_zero_int), inference(variable_rename,[status(thm)],[fact_227_power__0__Suc])).
102.77/103.01	thf(c_0_55, plain, ![X1364:int, X1365:nat]:((X1364)=(zero_zero_int)|(power_power_int @ X1364 @ X1365)!=(zero_zero_int)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_267_power__not__zero])])).
102.77/103.01	thf(c_0_56, negated_conjecture, (divide_divide_int @ (plus_plus_int @ (times_times_int @ x @ (semiri2019852685at_int @ pm)) @ (divide_divide_int @ n @ (power_power_int @ x @ pm))) @ (semiri2019852685at_int @ p))!=(x), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47, c_0_42]), c_0_48]), c_0_49]), c_0_42])).
102.77/103.01	thf(c_0_57, plain, ((divide_divide_int @ n @ (power_power_int @ x @ pm))=(x)|(power_power_int @ x @ pm)=(zero_zero_int)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_48]), c_0_51]), c_0_51]), c_0_52])).
102.77/103.01	thf(c_0_58, plain, (divide_divide_int @ (times_times_int @ x @ (semiri2019852685at_int @ p)) @ (semiri2019852685at_int @ p))=(x), inference(spm,[status(thm)],[c_0_53, c_0_42])).
102.77/103.01	thf(c_0_59, plain, ![X1:nat]:(power_power_int @ zero_zero_int @ (suc @ X1))=(zero_zero_int), inference(split_conjunct,[status(thm)],[c_0_54])).
102.77/103.01	thf(c_0_60, plain, ![X3:int, X1:nat]:((X3)=(zero_zero_int)|(power_power_int @ X3 @ X1)!=(zero_zero_int)), inference(split_conjunct,[status(thm)],[c_0_55])).
102.77/103.01	thf(c_0_61, negated_conjecture, (power_power_int @ x @ pm)=(zero_zero_int), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_57]), c_0_49]), c_0_45]), c_0_42]), c_0_58])])).
102.77/103.01	thf(c_0_62, plain, ![X1278:int]:(divide_divide_int @ X1278 @ zero_zero_int)=(zero_zero_int), inference(variable_rename,[status(thm)],[fact_182_div__by__0])).
102.77/103.01	thf(c_0_63, plain, ![X924:int]:(plus_plus_int @ X924 @ zero_zero_int)=(X924), inference(variable_rename,[status(thm)],[fact_291_plus__int__code_I1_J])).
102.77/103.01	thf(c_0_64, plain, (power_power_int @ zero_zero_int @ p)=(zero_zero_int), inference(spm,[status(thm)],[c_0_59, c_0_42])).
102.77/103.01	thf(c_0_65, negated_conjecture, (zero_zero_int)=(x), inference(spm,[status(thm)],[c_0_60, c_0_61])).
102.77/103.01	thf(c_0_66, plain, ![X1074:int]:(times_times_int @ zero_zero_int @ X1074)=(zero_zero_int), inference(variable_rename,[status(thm)],[fact_288_times__int__code_I2_J])).
102.77/103.01	thf(c_0_67, plain, ![X1055:int]:(divide_divide_int @ zero_zero_int @ X1055)=(zero_zero_int), inference(variable_rename,[status(thm)],[fact_180_bits__div__0])).
102.77/103.01	thf(c_0_68, plain, ![X3:int]:(divide_divide_int @ X3 @ zero_zero_int)=(zero_zero_int), inference(split_conjunct,[status(thm)],[c_0_62])).
102.77/103.01	thf(c_0_69, plain, ![X3:int]:(plus_plus_int @ X3 @ zero_zero_int)=(X3), inference(split_conjunct,[status(thm)],[c_0_63])).
102.77/103.01	thf(c_0_70, plain, (x)=(n), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64, c_0_65]), c_0_48]), c_0_65])).
102.77/103.01	thf(c_0_71, plain, ![X3:int]:(times_times_int @ zero_zero_int @ X3)=(zero_zero_int), inference(split_conjunct,[status(thm)],[c_0_66])).
102.77/103.01	thf(c_0_72, plain, ![X3:int]:(divide_divide_int @ zero_zero_int @ X3)=(zero_zero_int), inference(split_conjunct,[status(thm)],[c_0_67])).
102.77/103.01	thf(c_0_73, negated_conjecture, (divide_divide_int @ (times_times_int @ n @ (semiri2019852685at_int @ pm)) @ (semiri2019852685at_int @ p))!=(n), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56, c_0_61]), c_0_68]), c_0_69]), c_0_70]), c_0_70])).
102.77/103.01	thf(c_0_74, plain, ![X3:int]:(times_times_int @ n @ X3)=(n), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71, c_0_65]), c_0_65]), c_0_70]), c_0_70])).
102.77/103.01	thf(c_0_75, plain, ![X3:int]:(divide_divide_int @ n @ X3)=(n), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72, c_0_65]), c_0_65]), c_0_70]), c_0_70])).
102.77/103.01	thf(c_0_76, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73, c_0_74]), c_0_75])]), ['proof']).
102.77/103.01	# SZS output end CNFRefutation
102.77/103.01	# Proof object total steps             : 77
102.77/103.01	# Proof object clause steps            : 39
102.77/103.01	# Proof object formula steps           : 38
102.77/103.01	# Proof object conjectures             : 8
102.77/103.01	# Proof object clause conjectures      : 6
102.77/103.01	# Proof object formula conjectures     : 2
102.77/103.01	# Proof object initial clauses used    : 19
102.77/103.01	# Proof object initial formulas used   : 19
102.77/103.01	# Proof object generating inferences   : 14
102.77/103.01	# Proof object simplifying inferences  : 34
102.77/103.01	# Training examples: 0 positive, 0 negative
102.77/103.01	# Parsed axioms                        : 342
102.77/103.01	# Removed by relevancy pruning/SinE    : 0
102.77/103.01	# Initial clauses                      : 466
102.77/103.01	# Removed in clause preprocessing      : 70
102.77/103.01	# Initial clauses in saturation        : 396
102.77/103.01	# Processed clauses                    : 19793
102.77/103.01	# ...of these trivial                  : 406
102.77/103.01	# ...subsumed                          : 16374
102.77/103.01	# ...remaining for further processing  : 3013
102.77/103.01	# Other redundant clauses eliminated   : 165
102.77/103.01	# Clauses deleted for lack of memory   : 0
102.77/103.01	# Backward-subsumed                    : 60
102.77/103.01	# Backward-rewritten                   : 1109
102.77/103.01	# Generated clauses                    : 235901
102.77/103.01	# ...of the previous two non-trivial   : 227087
102.77/103.01	# Contextual simplify-reflections      : 18
102.77/103.01	# Paramodulations                      : 235452
102.77/103.01	# Factorizations                       : 11
102.77/103.01	# NegExts                              : 0
102.77/103.01	# Equation resolutions                 : 418
102.77/103.01	# Propositional unsat checks           : 0
102.77/103.01	#    Propositional check models        : 0
102.77/103.01	#    Propositional check unsatisfiable : 0
102.77/103.01	#    Propositional clauses             : 0
102.77/103.01	#    Propositional clauses after purity: 0
102.77/103.01	#    Propositional unsat core size     : 0
102.77/103.01	#    Propositional preprocessing time  : 0.000
102.77/103.01	#    Propositional encoding time       : 0.000
102.77/103.01	#    Propositional solver time         : 0.000
102.77/103.01	#    Success case prop preproc time    : 0.000
102.77/103.01	#    Success case prop encoding time   : 0.000
102.77/103.01	#    Success case prop solver time     : 0.000
102.77/103.01	# Current number of processed clauses  : 1620
102.77/103.01	#    Positive orientable unit clauses  : 323
102.77/103.01	#    Positive unorientable unit clauses: 35
102.77/103.01	#    Negative unit clauses             : 519
102.77/103.01	#    Non-unit-clauses                  : 743
102.77/103.01	# Current number of unprocessed clauses: 207365
102.77/103.01	# ...number of literals in the above   : 496599
102.77/103.01	# Current number of archived formulas  : 0
102.77/103.01	# Current number of archived clauses   : 1387
102.77/103.01	# Clause-clause subsumption calls (NU) : 562121
102.77/103.01	# Rec. Clause-clause subsumption calls : 473514
102.77/103.01	# Non-unit clause-clause subsumptions  : 11412
102.77/103.01	# Unit Clause-clause subsumption calls : 50114
102.77/103.01	# Rewrite failures with RHS unbound    : 0
102.77/103.01	# BW rewrite match attempts            : 1168
102.77/103.01	# BW rewrite match successes           : 326
102.77/103.01	# Condensation attempts                : 0
102.77/103.01	# Condensation successes               : 0
102.77/103.01	# Termbank termtop insertions          : 2929568
102.77/103.02	
102.77/103.02	# -------------------------------------------------
102.77/103.02	# User time                : 99.761 s
102.77/103.02	# System time              : 2.857 s
102.77/103.02	# Total time               : 102.618 s
102.77/103.02	# Maximum resident set size: 2112 pages
102.77/103.02	EOF
